A_Dfa Decidable

Acceptance for DFAs is Decidable (also, what is a "high-level" description?)

ALL_DPDA is Decidable

Emptiness for DFAs is Decidable

Decidable Language Example: THREE_DFA

Useless States in a DFA is Decidable!

ASU CSE355: Ch 4.1 Vid 2, Examples - D is DFA and L(D) = Sigma* is Decidable

Understanding how to decide whether a language for a DFA is decidable

Roel Van de Paar

Prove that Infinite DFA and Three DFA are Decidable Languages

ASU CSE355: Ch 4 Vid 2, Examples - Determine if languages are Decidable, TR, and/or Undecidable

Equivalence for DFAs is Decidable (3 different proofs!)

The Turing-Decidable Languages - Theory of Computing

Chris Marriott - Computer Science

Infinite DFAs (and showing it is decidable!)

How to check if a DFA satisfies a specification (SUB_DFA)!

ASU CSE355: Ch 4.1 Vid 4, Examples - D is DFA and L(D) is Finite is Decidable

Acceptance for Regular Expressions is Decidable

Lecture 15 (Computation Theory) Decidable and Undecidable Languages

Lecture 32/65: Decidability and Decidable Problems

hhp3

L11: Church-Turing Thesis and Examples of Decidable Languages

Recitation 12 0421 Decidable and undecidable languages, recognizable and unrecognizable languages

Computer Science Recitations